/*
 * To test loops detection and nested loops.
 */
int pantograph = 1;
const double shihudang = 64.520;
const double songjiang = 64.120;

int tiepi[10] = {
	95306, 12306, 75038, 64520, 64120,
	5033, 6437, 1461, 4471, 6419
};

double K1806(int command_code)
{
	double k1806 = 66.000;
	if (command_code == 75038)
	{
		while (k1806 > shihudang)
		{
			k1806 = k1806 - 0.1;
		}
		pantograph = 0;
		while (k1806 > songjiang)
		{
			k1806 = k1806 - 0.1;
		}
		pantograph = 1;
		return k1806;
	}
	else
		return -1.0;
}

// bubble sort
void CRsort()
{
	int i = 9, j, temp;
	while (i > 0)
	{
		j = 0;
		while (j < i)
		{
			if (tiepi[j] > tiepi[j + 1])
			{
				temp = tiepi[j];
				tiepi[j] = tiepi[j + 1];
				tiepi[j + 1] = temp;
			}
			j = j + 1;
		}
		i = i - 1;
	}
}

int main()
{
	int command_code, i = 0;
	double k1806;
	command_code = get_int();
	k1806 = K1806(command_code);
	print_double(k1806);
	CRsort();
	while (i < 10)
	{
		print_int(tiepi[i]);
		i = i + 1;
	}
	return 0;
}